skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Radziwiłł, Maksym"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. We prove an asymptotic formula for the eighth moment of Dirichlet L-functions averaged over primitive characters χ modulo q, over all moduli q≤Q and with a short average on the critical line. Previously the same result was shown conditionally on the Generalized Riemann Hypothesis by the first two authors. 
    more » « less
    Free, publicly-accessible full text available December 1, 2025
  2. Abstract We show that sequences of the form $$\alpha n^{\theta } \pmod {1}$$ with $$\alpha> 0$$ and $$0 < \theta < \tfrac {43}{117} = \tfrac {1}{3} + 0.0341 \ldots $$ have Poissonian pair correlation. This improves upon the previous result by Lutsko, Sourmelidis, and Technau, where this was established for $$\alpha> 0$$ and $$0 < \theta < \tfrac {14}{41} = \tfrac {1}{3} + 0.0081 \ldots $$. We reduce the problem of establishing Poissonian pair correlation to a counting problem using a form of amplification and the Bombieri–Iwaniec double large sieve. The counting problem is then resolved non-optimally by appealing to the bounds of Robert–Sargos and (Fouvry–Iwaniec–)Cao–Zhai. The exponent $$\theta = \tfrac {2}{5}$$ is the limit of our approach. 
    more » « less
  3. Abstract We asymptotically estimate the variance of the number of lattice points in a thin, randomly rotated annulus lying on the surface of the sphere. This partially resolves a conjecture of Bourgain, Rudnick, and Sarnak. We also obtain estimates that are valid for all balls and annuli that are not too small. Our results have several consequences: for a conjecture of Linnik on sums of two squares and a “microsquare”, a conjecture of Bourgain and Rudnick on the number of lattice points lying in small balls on the surface of the sphere, the covering radius of the sphere, and the distribution of lattice points in almost all thin regions lying on the surface of the sphere. Finally, we show that for a density 1. subsequence of squarefree integers, the variance exhibits a different asymptotic behaviour for balls of volume with . We also obtain analogous results for Heegner points and closed geodesics. Interestingly, we are able to prove some slightly stronger results for closed geodesics than for Heegner points or lattice points on the surface of the sphere. A crucial observation that underpins our proof is the different behaviour of weighting functions for annuli and for balls. © 2022 Courant Institute of Mathematics and Wiley Periodicals LLC. 
    more » « less
  4. Abstract Singmaster’s conjecture asserts that every natural number greater than one occurs at most a bounded number of times in Pascal’s triangle; that is, for any natural number $$t \geq 2$$, the number of solutions to the equation $$\binom{n}{m} = t$$ for natural numbers $$1 \leq m \lt n$$ is bounded. In this paper we establish this result in the interior region $$\exp(\log^{2/3+\varepsilon} n) \leq m \leq n - \exp(\log^{2/3+\varepsilon} n)$$ for any fixed ɛ > 0. Indeed, when t is sufficiently large depending on ɛ, we show that there are at most four solutions (or at most two in either half of Pascal’s triangle) in this region. We also establish analogous results for the equation $$(n)_m = t$$, where $$(n)_m := n(n-1) \dots (n-m+1)$$ denotes the falling factorial. 
    more » « less